MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          f#1(x1) -> mult#2(x1,mult#2(x1,x1))
          main(x1) -> map#2(rmap#2(rmap1#2(x1,Nil()),Nil()))
          map#2(Cons(x36,x6)) -> Cons(x36,map#2(x6))
          map#2(Nil()) -> Nil()
          mult#2(0(),x2) -> 0()
          mult#2(S(x4),x2) -> S(plus#2(mult#2(x4,x2),x2))
          plus#2(x4,0()) -> x4
          plus#2(x4,S(x2)) -> S(plus#2(x4,x2))
          rmap#2(Cons(x36,x10),x6) -> rmap#2(x10,Cons(x36,x6))
          rmap#2(Nil(),x2) -> x2
          rmap1#2(Cons(x13,Nil()),x8) -> Cons(f#1(x13),x8)
          rmap1#2(Cons(x27,Cons(x2,x25)),x17) -> rmap1#2(x25,Cons(plus#2(x2,S(S(0()))),Cons(f#1(x27),x17)))
          rmap1#2(Nil(),x2) -> x2
      - Signature:
          {f#1/1,main/1,map#2/1,mult#2/2,plus#2/2,rmap#2/2,rmap1#2/2} / {0/0,Cons/2,Nil/0,S/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f#1,main,map#2,mult#2,plus#2,rmap#2
          ,rmap1#2} and constructors {0,Cons,Nil,S}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE